Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph
نویسندگان
چکیده
منابع مشابه
On restricted edge-connectivity of half-transitive multigraphs
Let G = (V,E) be a multigraph (it has multiple edges, but no loops). We call G maximally edge-connected if λ(G) = δ(G), and G super edge-connected if every minimum edge-cut is a set of edges incident with some vertex. The restricted edgeconnectivity λ′(G) of G is the minimum number of edges whose removal disconnects G into non-trivial components. If λ′(G) achieves the upper bound of restricted ...
متن کاملMultigraph augmentation under biconnectivity and general edge-connectivity requirements
Given an undirected multigraph G = (V;E) and a requirement function r : 0 V 2 1 ! Z + (where 0 V 2 1 is the set of all pairs of vertices and Z + is the set of nonnegative integers), we consider the problem of augmenting G by the smallest number of new edges so that the local edge-connectivity and vertex-connectivity b e t ween every pair x; y 2 V become at least r (x; y) and two, respectively. ...
متن کاملInterval edge-colorings of cubic graphs
An edge-coloring of a multigraph with colors 1, is called an interval coloring if all colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. In this paper we prove that if is a connected cubic multigraph (a connected cubic graph) that admits an interval coloring, then G 2, , t ... t −
متن کاملCounting unlabelled three-connected and homeomorphically irreducible two-connected graphs
A graph will be assumed to be finite and unoriented, with no loops or multiple edges; if multiple edges are to be allowed, the term multigraph will be used. A graph or multigraph. will be called k-connected if at least k vertices and their incident edges must be removed to disconnect it (a complete graph is considered to be k-connected for any k). A block (respectively, multiblock) is a 2-conne...
متن کاملSource location problems considering vertex-connectivity and edge-connectivity simultaneously
Let G (V, E) be an undirected multigraph, where V and E are a set of vertices and a set of edges, respectively. Let k and l be fixed nonnegative integers. This paper considers location problems of finding a minimum-size vertex-subset S V such that for each vertex x V the vertex-connectivity between S and x is greater than or equal to k and the edge-connectivity between S and x is greater than o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Optim.
دوره 4 شماره
صفحات -
تاریخ انتشار 2000